L’art pariétal, objet virtuel de recherche ?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rapport De Recherche

In this paper we present a novel approach for mimicking expressions in 3D from a monocular video sequence. To this end, first we construct a high resolution semantic mesh model through automatic global and local registration of a low resolution range data. The MPEG-4 standard and radial basis functions are then considered to represent and animate such a model using a predefined set of control p...

متن کامل

Cahier de recherche

Globalization, the internationalization of markets, the knowledge economy, and e-business are among the interrelated phenomena whose emergence poses new challenges for the survival and adaptation of small and medium-sized enterprises (SMEs). For the various public and private organizations such as government agencies, universities and consulting firms that constitute the development infrastruct...

متن کامل

co-directeur de recherche

Pickup and Delivery Problems (PDPs) are a relevant class of vehicle routing problems in which objects or people need to be collected and distributed. These problems have many applications in logistics, ambulatory services and robotics. In this thesis, we survey the static and dynamic PDPs appearing in the literature, we provide a classification scheme for them, and we show the relations between...

متن کامل

(directeur de recherche)

We provide a tight analysis of Grover s algorithm for quantum database searching We give a simple closed form formula for the probability of success after any given number of iterations of the algo rithm This allows us to determine the number of iterations necessary to achieve almost certainty of nding the answer Furthermore we an alyze the behaviour of the algorithm when the element to be foun...

متن کامل

Équipe de Recherche DALI

In this paper, we present a recent algorithm given by Ogita, Rump and Oishi [39] for accurately computing the sum of n floating point numbers. They also give a computational error bound for the computed result. We apply this algorithm in computing determinant and more particularly in computing robust geometric predicates used in computational geometry. We improve existing results that use eithe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Les Nouvelles de l'archéologie

سال: 2018

ISSN: 0242-7702,2425-1941

DOI: 10.4000/nda.5440